Testing flow graph reducibility

Flow Hypergraph Reducibility

Reducible flowgraphs were introduced by [3, 4] to analyse the control flow of a computer program. Although they were initially used in code optimisation algorithms, several theoretical problems have been studied for the class [5, 6]. A reducible flowgraph G = (V,E, s) is a digraph such that any depth-first search (DFS) on G starting at s determines the same set of back arcs. The characterisatio...

Reducibility between Classes of Port Graph Grammar

This paper introduces a general notion of static-port graph grammar (SPGG) that encompasses existing formalisms that have been independently proposed, such as Linear Graph Grammars [Baw93], Interaction Nets [Laf90] and Partial Sharing Graphs [Lam90]. These formalisms have been shown to provide a computational framework for asynchronous computation that respects a very rigorous notion of local i...

Towards Flow Graph Directed Testing of Functional Programs

Testing of software components during development is a heavily used approach to detect programming errors and to evaluate the quality of software. Systematic approaches to software testing get a more and more increasing impact on software development processes. In the context of imperative programming there are several different approaches to measure the appropriateness of a set of test cases f...

Reducibility of gene patterns in ciliates using the breakpoint graph

Gene assembly in ciliates is one of the most involved DNA processings going on in any organism. This process transforms one nucleus (the micronucleus) into another functionally different nucleus (the macronucleus). We continue the development of the theoretical models of gene assembly, and in particular we demonstrate the use of the concept of the breakpoint graph, known from another branch of ...

A Fast Algorithm for Testing Reducibility of Trinomials